Welcome![Sign In][Sign Up]
Location:
Search - sentence parser

Search list

[ELanguageSentence.rar

Description: 这是一个和lex功能差不多的parser编写的程序
Platform: | Size: 1048 | Author: | Hits:

[Other2005060717340116648

Description: LL(1)语法分析器,对任意输入LL(1)文法的分析表及字符串, 否为该文法的句子,并能给出分析过程。-LL (1) parser, the indiscriminate importation of LL (1) grammar analysis table and string, whether or not the sentence grammar, and can provide analysis process.
Platform: | Size: 7160 | Author: 飒飒 | Hits:

[ELanguageLALR(1)forwins

Description: 一个LALR(1)语法分析器,可以输入文法进行分析,也可以分析句子,非常方便-an LALR (1) parser, can be imported to analyze grammar, sentence can be analyzed, very convenient
Platform: | Size: 13219 | Author: 杜立博 | Hits:

[ELanguageLR0rrr1

Description: LR0分析器,一个LALR(1)语法分析器,可以输入文法进行分析,也可以分析句子,非常方便-LR0 analyzers, a LALR (1) parser, can be imported grammar analysis may also analyze the sentence, a very convenient
Platform: | Size: 2523 | Author: | Hits:

[Other编译原理双语书

Description:

编译原理双语书   Moving on to the code generation, the goal of this phase is to build a compiler given that the programs in the phase of parser have been strictly recognized without any error, here the error means that the input is an illegal sentence in the grammar. However, before generating code, first you need to build the bar-bones recognizer.     

 We need create some temporary variables and maintain internally by the compiler. The step of generating Code is as follows. First, create a mechanism for allocating temporaries. In fact, the temporaries should be recycled, that is they should be reused after they are no longer needed in the current subexpression. Second, determine the name of the temporary that  uses arguments and return values. So, this section of code generator consists of generating code for a binary operator, generating code for a copy instruction, generating code for an instruction which loads the argument into a register, and then write it onto the new stack frame, including the standard call sequence and the standard return sequence.  


Platform: | Size: 2519805 | Author: joan18 | Hits:

[ELanguageSentence

Description: 这是一个和lex功能差不多的parser编写的程序-This is a lex functions and similar procedures for the preparation parser
Platform: | Size: 1024 | Author: 吴培 | Hits:

[ELanguage2005060717340116648

Description: LL(1)语法分析器,对任意输入LL(1)文法的分析表及字符串, 否为该文法的句子,并能给出分析过程。-LL (1) parser, the indiscriminate importation of LL (1) grammar analysis table and string, whether or not the sentence grammar, and can provide analysis process.
Platform: | Size: 968704 | Author: 飒飒 | Hits:

[ELanguageyufafenxisaomiaochenxu

Description: 了解语法分析器的内部工作原理,通过在本次实验中运用一定的编程技巧,掌握对表达式进行处理的一种方法。① 对输入文法,由程序自动构造FIRST FOLLOW集② 对输入文法,由程序自动生成它的LL(1)分析表;③ 对于给定的输入串,应能判断识别该串是否为给定文法的句型。-Understanding of the internal parser working principle, in this experiment through the use of a certain degree of programming skills, master of the expression of a way to deal with. ① the input grammar, automatically constructed by the procedures set FIRST FOLLOW ② the input grammar, it is automatically generated by the process of LL (1) analysis table ③ For a given input strings, should be able to identify the string to determine whether a given grammar sentence.
Platform: | Size: 1031168 | Author: vivian | Hits:

[ELanguageyufafenxi_ll(1)

Description: 学编译原理时写的一个语法分析程序 一.[目的要求] ① 对输入文法,由程序自动构造FIRST FOLLOW集 ② 对输入文法,由程序自动生成它的LL(1)分析表; ③ 对于给定的输入串,应能判断识别该串是否为给定文法的句型。 二.[题目分析] 该程序可分为如下几步: (1)读入文法 (2)判断正误 (3)若无误,判断是否为LL(1)文法 (4)若是,构造分析表; (5)由总控算法判断输入符号串是否为该文法的句型。 -Studies Compilation Principle of a time to write a parser. [Objective request] ① the input grammar, automatically constructed by the procedures set FIRST FOLLOW ② the input grammar, it is automatically generated by the process of LL (1) analysis table ③ For a given input strings, should be able to identify the string to determine whether given the sentence grammar.二. [Title Analysis] The program can be divided into the following steps: (1) read into the grammar (2) The judge is false (3) If correct, determine whether to LL (1) grammar (4) If so, structural analysis table (5) controlled by the general algorithm to determine whether the string of input symbols for the grammar of the sentence.
Platform: | Size: 5120 | Author: 李爱春 | Hits:

[ELanguageLALR(1)forwins

Description: 一个LALR(1)语法分析器,可以输入文法进行分析,也可以分析句子,非常方便-an LALR (1) parser, can be imported to analyze grammar, sentence can be analyzed, very convenient
Platform: | Size: 13312 | Author: 杜立博 | Hits:

[ELanguageLR0rrr1

Description: LR0分析器,一个LALR(1)语法分析器,可以输入文法进行分析,也可以分析句子,非常方便-LR0 analyzers, a LALR (1) parser, can be imported grammar analysis may also analyze the sentence, a very convenient
Platform: | Size: 2048 | Author: | Hits:

[Windows DevelopEarleyParser

Description: The early parser is like a dynamic programming. The reasonable time vs sentence length should be O(n^2) n=input length. But I don’t know why the execution time are all very short to be examinated.-The early parser is like a dynamic programming. The reasonable time vs sentence length should be O (n ^ 2) n = input length. But I don t know why the execution time are all very short to be examinated.
Platform: | Size: 43008 | Author: 詹包 | Hits:

[ELanguageLR

Description: 1.实验目的 设计一个LR分析器,实现对表达式语言的分析,加深对LR语法分析方法的基本思想的理解,掌握LR分析器设计与实现的基本方法。 2.实验要求 建立文法及其LR分析表表示的数据结构,设计并实现一个LALR(1)的分析器,对源程序经词法分析后生成的二元式代码流进行分析,如果输入串是文法定义的句子则输出“是”,否则输出“否”。 3.实验内容 (1)文法描述及其LALR(1)分析表 描述表达式语言的文法G如下: -1. The experiment was to design a LR parser, the realization of the analysis of the expression language, better understanding of the LR parsing method to understand the basic idea of the master LR parser design and implementation of the basic method. 2. Experiment called for the establishment of grammar and LR analysis table that the data structure, design and realization of a LALR (1) of the analyzer, lexical analysis of source code generated by the binary-type code flow analysis, if the input strings is the definition of grammar sentence is the output " yes" , otherwise output " no." 3. Experimental (1) grammar description and LALR (1) Analysis of the expression language described in Table G of the grammar are as follows:
Platform: | Size: 289792 | Author: sh_xj | Hits:

[ELanguageLR1-parser

Description: LR1语法分析器,输入文法,可以对句子进行扫描,并判断句子是否可接收-LR1 parser, the input grammar, you can scan the sentence and determine whether it can receive a sentence
Platform: | Size: 5053440 | Author: 李明 | Hits:

[ELanguageLL-(1)-parser

Description: LL(1)语法分析器设计 1.如下为给定的LL(1)文法。 G[<P>]: 1) <P>->program <D> : <T> begin <S> end {program} 2) D->i D’ {i} 3) D’->, i D’ {,} 4) D’->ε {:} 5) S->s S’ {s} 6) S’-> s S’ { } 7) S’->ε {end} 8) T->real {real} 9) T->integer {integer} 其中右侧{}内为产生的可选集。 2.调试并完善如下给出的文法的LL(1)分析器示例程序,并设输入的文法的句子为: program i , i , i : integer begin s s s end 给出输出结果并进行分析说明。 -1. Below for a given LL (1) grammar. G [<P>]: 1) <P>-> program <D>: <T> begin <S> end {program} 2) D-> i D {i} 3) D ->, i D {,} 4) D -> ε {:} 5) S-> s S {s} 6) S -> s S { } 7) S -> ε {end} 8) T-> real {real} 9) T-> integer {integer} {} within which the right to produce an optional set. 2. Debug and improve the grammar given in the following LL (1) analyzer sample program, and set the input sentence is the grammar: program i, i, i: integer begin s s s end Output and analysis are given instructions.
Platform: | Size: 190464 | Author: 浮云 | Hits:

[ELanguageLR-parser

Description: LR分析器设计 给定说明语句的拓广文法G[S ]如下: (0) S ->S (1) S->v I:T (2) I->I,i (3) I->i (4) T->r 其中v代表终结符var,r代表real。 其识别规范句型活前缀的DFA及LR(0)分析表如下: 输入 状态 ACTION表 GOTO表 v i , : r # S I T 0 S2 1 1 acc 2 S4 3 3 S6 S5 4 r3 r3 r3 r3 r3 r3 5 S9 8 6 S7 7 r2 r2 r2 r2 r2 r2 8 r1 r1 r1 r1 r1 r1 9 r4 r4 r4 r4 r4 r4 编程实现此文法的LR分析器,并设输入的文法的句子为: var i , i , i : real 给出输出结果 -LR parser design Given that statement, The Extension of the grammar G [S ] as follows: (0) S -> S (1) S-> v I: T (2) I-> I, i (3) I-> i (4) T-> r One representative of terminator v var, r representative of real. Living patterns of its identification Specification prefix DFA and LR (0) analysis as follows: Input GOTO table table status ACTION v i,: r# S I T 0 S2 1 1 acc 2 S4 3 3 S6 S5 4 r3 r3 r3 r3 r3 r3 5 S9 8 6 S7 7 r2 r2 r2 r2 r2 r2 8 r1 r1 r1 r1 r1 r1 9 r4 r4 r4 r4 r4 r4 Programming LR parser article law, and set the input sentence is the grammar: var i, i, i: real Given output
Platform: | Size: 212992 | Author: 浮云 | Hits:

[MultiLanguageparser

Description: 基于条件随机场的汉语自动分词系统。把句子划分成一个一个的词-Based on the conditions of the airport with Chinese automatic segmentation system. The sentence was divided into an a word
Platform: | Size: 15023104 | Author: moses kang | Hits:

[JSP/Javaparser-m

Description: 利用parser进行英文句子的句法分析,能够比较好的解决句法分析问题-Parser English sentence parsing, a better solution to the problem of parsing
Platform: | Size: 3072 | Author: 李大鹏 | Hits:

[ConsoleThe-LL1-parser

Description: 输入: 非终结符号串:AB 终结符号串:a 起始符号:A 文法个数:2 第一个产生式:A->aB|a 第二个产生式:B->a 输出 first follow集 输入:测试句型 aa 语法正确 测试句型 ab 语法不正确-Input: Nonterminal symbol string: AB The end of string symbol: a Start symbol: A The number of grammar: 2 The first generation type: A->aB|a The second generation type: B->a Output First follow set Input: the test sentence proper AA syntax The test sentences AB syntax is incorrect
Platform: | Size: 459776 | Author: 何志鹏 | Hits:

[Windows DevelopParser

Description: (1)本分析程序所分析的文法如下: G[E]: E→eBaA A→a|bAcB B→dEd|aC C→e|dC (2)针对上述文法编写一递归子程序分析程序,该程序的输入是任意符号串,输出是本次输入的符号串是否是该文法的句子的结论。 -(1) The analysis procedure grammar analysis as follows: G[E]: E→eBaA A→a|bAcB B→dEd|aC C→e|dC (2) for the above grammar write a recursive routine analysis program, enter the program is arbitrary string of symbols, this output is a string of symbols whether the input is the grammar of the sentence conclusion.
Platform: | Size: 1024 | Author: Walker | Hits:
« 12 »

CodeBus www.codebus.net